Efficient Orthogonal Range Reporting in Three and Higher Dimensions ∗
نویسندگان
چکیده
In orthogonal range reporting we are to preprocess N points in d dimensions such that the points inside an axis-aligned query box can be found efficiently. This is a fundamental problem in various fields, including spatial databases and computational geometry. In this paper we construct the first data structure for orthogonal range reporting in the I/O-model in higher dimensions and also significantly improve the best previous space lower bound.
منابع مشابه
New Data Structures for Orthogonal Range Searching
We present new general techniques for static orthogonal range searching problems in two and higher dimensions. For the general range reporting problem in , we achieve query time using space , where denotes the number of stored points and the number of points to be reported. For the range reporting problem on an ! " grid, we achieve query time # $ % & using space ' ( . For the two-dimensional se...
متن کاملExploring the Problem Space of Orthogonal Range Searching
Orthogonal range searching is a fundamental problem in computational geometry: preprocess a set of points into a data structure such that we can efficiently answer questions about the points that lie in axis-aligned rectangles called query ranges. There are many interesting variants of orthogonal range searching with differing complexities. We consider classic fundamental variants, new variants...
متن کاملEfficient Range Reporting of Convex Hull
We consider the problem of reporting convex hull points in an orthogonal range query in two dimensions. Formally, let P be a set of n points in R. A point lies on the convex hull of a point set S if it lies on the boundary of the minimum convex polygon formed by S. In this paper, we are interested in finding the points that lie on the boundary of the convex hull of the points in P that also fal...
متن کاملAn Efficient Hierarchical Modulation based Orthogonal Frequency Division Multiplexing Transmission Scheme for Digital Video Broadcasting
Due to the increase of users the efficient usage of spectrum plays an important role in digital terrestrial television networks. In digital video broadcasting, local and global content are transmitted by single frequency network and multifrequency network respectively. Multifrequency network support transmission of global content and it consumes large spectrum. Similarly local content are well ...
متن کاملOn Geometric Range Searching, Approximate Counting and Depth Problems
In this thesis we deal with problems connected to range searching, which is one of the central areas of computational geometry. The dominant problems in this area are halfspace range searching, simplex range searching and orthogonal range searching and research into these problems has spanned decades. For many range searching problems, the best possible data structures cannot offer fast (i.e., ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010